| 1. | Non - preemptive priority queuing discipline
非强占优先规则 |
| 2. | Non - preemptive priority queueing models with changeover times and switching threshold
带有转换时间和阈值的非抢占优先权排队模型 |
| 3. | As elements are added to a priority queue , its capacity grows automatically
作为元素被加入一个优先队列，它的容量是自动增加的。 |
| 4. | Starvation is a common limitation of simple priority queuing mechanisms
简单的优先权排队机理的一个常见局限就是“饥饿” （即访问要求不能满足） 。 |
| 5. | Thus , priority queueing systems are usually adopted in the performance analysis of a router
这样对路由器的性能分析通常要采用优先排队系统的分析技巧。 |
| 6. | Say , for instance , that your scheduler checks the strict priority queue and there is nothing there
譬如说，假设调度程序检查严格的优先级队列后，发现没有任何优先级队列。 |
| 7. | As grid machines become available to execute jobs , the jobs are taken from the highest priority queues first
当网格计算机可以执行任务的时候，就从优先级最高的队列中取出第一个任务。 |
| 8. | A priority queue is unbounded , but has an internal capacity governing the size of an array used to store the elements on the queue
一个优先队列是极大的，但是拥有一个内部的容量调节数组的大小用来存储在队列中的元素。 |
| 9. | No - interrupted priority queue polling mechanism with exhaustive service is applied as a channel accession policy in the communication in this paper
本通信系统采用了基于完全服务的非抢占排队优先权轮询机制作为信道共享策略。 |
| 10. | Such queues are called priority queues ; in this type of queue service is not in order of time of arrival but rather in order of some measure of priority
这种队列称为优先级队列；在这种队列中，服务顺序是按照事件优先级而非事件到达先后而定的。 |
